Unreliable point facility location problems on networks
نویسندگان
چکیده
منابع مشابه
Unreliable point facility location problems on networks
In this paper we study facility location problems on graphs under the most common criteria, such as, median, center and centdian, but we incorporate in the objective function some reliability aspects. Assuming that facilities may become unavailable with a certain probability, the problem consists of locating facilities minimizing the overall or the maximum expected service cost in the long run,...
متن کاملEffectiveness-equity models for facility location problems on tree networks
We propose models to investigate effectiveness-equity tradeoffs in tree network facility location problems. We use the commonly used median objective as a measure of effectiveness, and the Gini index as a measure of (in)equity, and formulate bicriteria problems involving these objectives. We develop procedures to identify an efficient set of solutions to these problems, analyze the complexity o...
متن کاملFacility Location on a Network with Unreliable Links
In this paper we study a simple vulnerability-based stochastic dependency model of link failures in a network prone to disasters. Under this model, we study the problem of locating k facilities to maximize the expected demand serviced within a given distance, and show its equivalence to the well-studied maximum k-facility location problem. In the special case when there is no distance constrain...
متن کاملExtensive facility location problems on networks with equity measures
This paper deals with the problem of locating path-shaped facilities of unrestricted length on networks. We consider as objective functions measures conceptually related to the variability of the distribution of the distances from the demandpoints to a facility.We study the following problems: locating a path which minimizes the range, that is, the difference between the maximum and the minimum...
متن کاملReverse facility location problems
In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.10.013